On transitive and fully transitive primary groups

On Transitive Permutation Groups

We assign names and new generators to the transitive groups of degree up to 15, reflecting their structure.

AUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS

An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...

Finite Transitive Permutation Groups and Finite Vertex-Transitive Graphs

The theory of vertex-transitive graphs has developed in parallel with the theory of transitive permutation groups. In this chapter we explore some of the ways the two theories have influenced each other. On the one hand each finite transitive permutation group corresponds to several vertex-transitive graphs, namely the generalised orbital graphs which we shall discuss below. On the other hand, ...

Two-transitive Lie groups

Using a characterization of parabolics in reductive Lie groups due to Furstenberg, elementary properties of buildings, and some algebraic topology, we give a new proof of Tits’ classification of 2-transitive Lie groups. Among many other results, Tits classified in [41] all 2-transitive Lie groups. His proof is based on Dynkin’s classification of maximal complex subalgebras in complex simple Lie...

Generating Transitive Permutation Groups